package leetcode_2401_2500;

public class LeeCode_2490 {
    public static void main(String[] args) {

    }
    private static boolean isCircularSentence(String sentence) {
        String[] son = sentence.split(" ");
        for (int i = 0; i < son.length; i++) {
            if (i == son.length - 1){
                return son[i].charAt(son[i].length() - 1) == son[0].charAt(0);
            }
            if (son[i].charAt(son[i].length() - 1) != son[i + 1].charAt(0)){
                return false;
            }
        }
        return true;
    }
}
